Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs
نویسندگان
چکیده
منابع مشابه
Finding a Maximum 2-Matching Excluding Prescribed Cycles in Bipartite Graphs
We introduce a new framework of restricted 2-matchings close to Hamilton cycles. For an undirected graph (V,E) and a family U of vertex subsets, a 2-matching F is called U-feasible if, for each U ∈ U , F contains at most |U | − 1 edges in the subgraph induced by U . Our framework includes C≤k-free 2-matchings, i.e., 2-matchings without cycles of at most k edges, and 2-factors covering prescribe...
متن کاملMaximum semi-matching problem in bipartite graphs
An (f, g)-semi-matching in a bipartite graph G = (U ∪V,E) is a set of edges M ⊆ E such that each vertex u ∈ U is incident with at most f(u) edges of M , and each vertex v ∈ V is incident with at most g(v) edges of M . In this paper we give an algorithm that for a graph with n vertices and m edges, n ≤ m, constructs a maximum (f, g)semi-matching in running time O(m ·min( √∑ u∈U f(u), √∑ v∈V g(v)...
متن کاملA scaling algorithm for maximum weight matching in bipartite graphs
Given a weighted bipartite graph, the maximum weight matching (MWM) problem is to find a set of vertex-disjoint edges with maximum weight. We present a new scaling algorithm that runs in O(m √ n logN) time, when the weights are integers within the range of [0, N ]. The result improves the previous bounds of O(Nm √ n) by Gabow and O(m √ n log (nN)) by Gabow and Tarjan over 20 years ago. Our impr...
متن کاملCycles in hamiltonian graphs of prescribed maximum degree
Let G be a hamiltonian graph G of order n and maximum degree , and let C(G) denote the set of cycle lengths occurring in G. It is easy to see that |C(G)|¿ − 1. In this paper, we prove that if ¿n=2, then |C(G)|¿ (n + − 3)=2. We also show that for every ¿ 2 there is a graph G of order n¿ 2 such that |C(G)|= − 1, and the lower bound in case ¿n=2 is best possible. c © 2003 Elsevier Science B.V. All...
متن کاملCoarse Grained Parallel Maximum Matching In Convex Bipartite Graphs
We present a coarse grained parallel algorithm for computing a maximum matching in a convex bipartite graph G = (A;B;E). For p processors with N=p memory per processor, N = jAj+ jBj, N=p p, the algorithm requires O(log p) communication rounds and O(Tsequ(np ; m p ) + n p log p) local computation, where n = jAj, m = jBj and Tsequ(n;m) is the sequential time complexity for the problem. For the BS...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2017
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2017.05.003